Agnostic sampling transceiver
نویسندگان
چکیده
Increasing capacity demands in the access networks require inventive concepts for transmission and distribution of digital as well analog signals over same network. Here a new transceiver system, which is completely agnostic to be transmitted presented. Nyquist sampling time multiplexing N phase intensity modulated channels with one single modulator, demultiplexing another modulator have been demonstrated. The aggregate symbol rate corresponds bandwidth can further increased by modification setup. No high-speed electronic signal processing or high photonics required. Apart from its simplicity possibility process low electronics photonics, method has potential easily integrated into any platform thus, might solution increasing data rates future networks.
منابع مشابه
Agnostic Clustering
Motivated by the principle of agnostic learning, we present an extension of the model introduced by Balcan, Blum, and Gupta [3] on computing low-error clusterings. The extended model uses a weaker assumption on the target clustering, which captures data clustering in presence of outliers or ill-behaved data points. Unlike the original target clustering property, with our new property it may no ...
متن کاملAgnostic Boosting
We extend the boosting paradigm to the realistic setting of agnostic learning, that is, to a setting where the training sample is generated by an arbitrary (unknown) probability distribution over examples and labels. We deene a-weak agnostic learner with respect to a hypothesis class F as follows: given a distribution P it outputs some hypothesis h 2 F whose error is at most erP(F) + , where er...
متن کاملAgnostic Domain Adaptation
The supervised learning paradigm assumes in general that both training and test data are sampled from the same distribution. When this assumption is violated, we are in the setting of transfer learning or domain adaptation: Here, training data from a source domain, aim to learn a classifier which performs well on a target domain governed by a different distribution. We pursue an agnostic approa...
متن کاملDistribution-Specific Agnostic Boosting
We consider the problem of boosting the accuracy of weak learning algorithms in the agnostic learning framework of Haussler (1992) and Kearns et al. (1992). Known algorithms for this problem (BenDavid et al., 2001; Gavinsky, 2002; Kalai et al. , 2008) follow the same strategy as boosting algorithms in the PAC model: the weak learner is executed on the same target function but over different dis...
متن کاملAgnostic Online learnability
We study a fundamental question. What classes of hypotheses are learnable in the online learning model? The analogous question in the PAC learning model [12] was addressed by Vapnik and others [13], who showed that the VC dimension characterizes the learnability of a hypothesis class. In his influential work, Littlestone [9] studied the online learnability of hypothesis classes, but only in the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Optics Express
سال: 2021
ISSN: ['1094-4087']
DOI: https://doi.org/10.1364/oe.425548